Optimal Tiling

نویسندگان

  • Rumen Andonov
  • Sanjay Rajopadhye
چکیده

Iteration space tiling is a common strategy used by parallelizing compilers to reduce communication overhead. We address the problem of determining the optimal tile size (which minimizes the total execution time of the program), for a particular program schema. We use a realistic model of the architecture which accounts for coprocessors that permit overlapping of communication and computation, context switching times, etc. Determining the optimal tile size is shown to reduce to a non-linear optimization problem. We solve this analytically, yielding a closed form solution that involves only parameters of the architecture and program that are easily determined at compile time. It can thus be used by a compiler before code generation. Although we solve the problem for a particular schema of programs, our results can be generalized to uniform dependence loops and also to certain classes of loop programs with dynamic dependence vectors. Pavage Optimal R esum e : Le partitionnement en tuiles de l'espace d'it erations est une strat egie souvent utilis ee par les compilateurs parall eliseurs pour r eduire le co^ ut des communications. Nous consid erons la d etermination de la taille optimale de la tuile dans un cas particulier. Nous utilisons un mod ele r ealiste d'architecture qui prend en compte les coprocesseurs de communication, le recouvrement calculs/communications etc. La d etermination de la taille optimale de la tuile se ram ene alors a un probl eme d'optimisation non-lin eaire ayant comme fonction objectif le temps total d'ex ecution du programme. Pour ce probl eme nous obtenons une solution analytique qui n'implique que des param etres de l'architecture et du programme facilement d etermin es a la compilation. Ceci permet l'utilisation de cette solution analytique avant la g en eration du code. Bien que nous consid erons un sch ema particulier de programme, nos r esultats peuvent ^ etre facilement g en eralis es au cas des boucles de d ependances uniformes et pour une classe de boucles ayant des vecteurs de d ependences dynamiques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

(Pen)-ultimate tiling?

In the framework of perfect loop nests with uniform dependences, tiling is a technique used to group elemental computation points so as to increase computation granularity and to reduce the overhead due to communication time. We review existing approaches from the literature, together with the optimization criteria that are used for determining a \good" or \optimal" tiling. Then we explain the ...

متن کامل

Polygonal tiling of some surfaces containing fullerene molecules

A tiling of a surface is a decomposition of the surface into pieces, i.e. tiles, which cover it without gaps or overlaps. In this paper some special polygonal tiling of sphere, ellipsoid, cylinder, and torus as the most abundant shapes of fullerenes are investigated.

متن کامل

Optimal Tiling Algorithms for Inter-frame Video Compression

We propose the use of large dictionaries of tilings for video compression and develop fast algorithms to select the optimal tiling for both the motion compensation and transform stages of a video coder. We illustrate the effectiveness of this approach by showing that our tiling selection method results in up to 23% savings in bit rate as compared to the H.264/AVC tiling selection, for several s...

متن کامل

Tiling for Heterogeneous Computing Platforms Ecole Normale Supérieure De Lyon Tiling for Heterogeneous Computing Platforms Tiling for Heterogeneous Computing Platforms

In the framework of fully permutable loops tiling has been extensively studied as a source to source program transformation However little work has been devoted to the mapping and scheduling of the tiles on physical processors Moreover targeting hetero geneous computing platforms has to the best of our knowledge never been considered In this paper we extend tiling techniques to the context of l...

متن کامل

Learning Retinal Tiling in a Model of Visual Attention

We describe a neural network model in which the tiling of the input array is learned by performing a joint localization and classification task. After training, the optimal tiling that emerges resembles the eccentricity dependent tiling of the human retina.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994